Low coefficient complexity approximations of the one dimensional discrete cosine transform
نویسندگان
چکیده
A method for the design of arbitrarily exact Discrete Cosine Transform (DCT) approximations that permit perfect reconstruction using fixed point arithmetic is presented. Simple quantization of floating point precision coefficients typically leads to DCT approximations which fail to meet the coding gain, Mean Square Error (MSE), and coefficient complexity (number of coefficient adders and subtractors) specifications. It is shown that it is possible to design DCT approximations with near optimal coding gains that meet the MSE and coefficient complexity requirements. Finite precision effects are discussed for these DCT approximations.
منابع مشابه
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) whenever only a few DCT coefficients are actually encoded. We employ a novel hierarchical vector quantization (HVQ)-based image analyzer to drive a bank of coders, thus switching to the fastest coder depending on the i...
متن کاملReduced DCT approximations for low bit rate coding
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT coefficients are actually encoded. In one instantiation we employ a data analyzer to drive a bank of coders by switching to the fastest coder depending on the image contents or on the output demand. The compression sp...
متن کاملRapid Prototyping of Field Programmable Gate Array-Based Discrete Cosine Transform Approximations
A method for the rapid design of field programmable gate array (FPGA)-based discrete cosine transform (DCT) approximations is presented that can be used to control the coding gain, mean square error (MSE), quantization noise, hardware cost, and power consumption by optimizing the coefficient values and datapath wordlengths. Previous DCT design methods can only control the quality of the DCT app...
متن کاملNAG SMP Library Tuned and Enhanced Routines in the NAG SMP Library
C06FKF Circular convolution or correlation of two real vectors, extra workspace for greater speed C06FPF Multiple one-dimensional real discrete Fourier transforms C06FQF Multiple one-dimensional Hermitian discrete Fourier transforms C06FRF Multiple one-dimensional complex discrete Fourier transforms C06FUF Two-dimensional complex discrete Fourier transform C06FXF Three-dimensional complex discr...
متن کاملEnergy-efficient 8-point DCT Approximations: Theory and Hardware Architectures
Due to its remarkable energy compaction properties, the discrete cosine transform (DCT) is employed in a multitude of compression standards, such as JPEG and H.265/HEVC. Several low-complexity integer approximations for the DCT have been proposed for both 1-D and 2-D signal analysis. The increasing demand for low-complexity, energy efficient methods require algorithms with even lower computatio...
متن کامل